A New Concept for Parallel
نویسنده
چکیده
This paper presents a new concept for a parallel neurocom-puter architecture which is based on a conngurable neuroprocessor design. The neuroprocessor adapts its internal parallelism dynamically to the required data precision for achieving an optimal utilization of the available hardware resources. This is realized by encoding a variable number of p diierent data elements in one very long data word of b bits. All components of the neuroproccessor (multiplier, accumulator, adder, : : :) support the parallel execution of p operations on all data elements of one very long data word.
منابع مشابه
A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملDexterous Workspace Shape and Size Optimization of Tricept Parallel Manipulator
This work intends to deal with the optimal kinematic synthesis problem of Tricept parallel manipulator. Observing that cuboid workspaces are desirable for most machines, we use the concept of effective inscribed cuboid workspace, which reflects requirements on the workspace shape, volume and quality, simultaneously. The effectiveness of a workspace is characterized by the dexterity of the manip...
متن کاملForward Position Kinematics of a Parallel Manipulator with New Architecture
The forward position kinematics (FPK) of a parallel manipulator with new architecture supposed to be used as a moving mechanism in a flight simulator project is discussed in this paper. The closed form solution for the FPK problem of the manipulator is first determined. It has, then, been shown that there are at most 24 solutions for FPK problem. This result has been verified by using other tec...
متن کاملA New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm
This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...
متن کاملA New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines
Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessme...
متن کاملA New Method to Improve Automated Classification of Heart Sound Signals: Filter Bank Learning in Convolutional Neural Networks
Introduction: Recent studies have acknowledged the potential of convolutional neural networks (CNNs) in distinguishing healthy and morbid samples by using heart sound analyses. Unfortunately the performance of CNNs is highly dependent on the filtering procedure which is applied to signal in their convolutional layer. The present study aimed to address this problem by a...
متن کامل